Efficient computation of optimal temporal walks under waiting-time constraints

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Time-optimal trajectory generator under jerk constraints

Step response is widely used as the performance index of controlled systems. Thus, the ideal system would be one that has an output which approaches to the step signal quickly without error or over-shoot. However, if the output of an actual plant converges to the reference signal in a very short period, it can be dangerous to the surrounding environment as well as the operators. Furthermore, th...

متن کامل

Optimal computation with non-unitary quantum walks

Quantum versions of random walks on the line and the cycle show a quadratic improvement over classical random walks in their spreading rates and mixing times respectively. Non-unitary quantum walks can provide a useful optimisation of these properties, producing a more uniform distribution on the line, and faster mixing times on the cycle. We investigate the interplay between quantum and random...

متن کامل

Efficient Optimal Search under Expensive Edge Cost Computation

Optimal heuristic search has been successful in many domains where the cost of each action can easily be obtained. However, in many problems, the exact edge cost is expensive to compute. Existing search algorithms face a significant performance bottleneck, due to an excessive overhead associated with dynamically calculating exact edge costs. We present DEA*, an algorithm for problems with expen...

متن کامل

Approximate FPGA-based LSTMs under Computation Time Constraints

Recurrent Neural Networks and in particular Long ShortTerm Memory (LSTM) networks have demonstrated state-of-the-art accuracy in several emerging Artificial Intelligence tasks. However, the models are becoming increasingly demanding in terms of computational and memory load. Emerging latency-sensitive applications including mobile robots and autonomous vehicles often operate under stringent com...

متن کامل

Waiting time computation for blood collection sites

As blood donations are provided on a voluntary non-remunerated basis, blood donors should be treated as user-friendly as possible. Delays and waiting times within blood collection sites (donor centers) should thus be kept at acceptable levels. Waiting times are not incorporated directly other than by practical experience. A more rigorous approach is required. An analytic waiting time computatio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied Network Science

سال: 2020

ISSN: 2364-8228

DOI: 10.1007/s41109-020-00311-0